Scheduling of transportation fleet based on the customer’s priority in a hub location problem

This study proposes six novel techniques on the customer’s priority while addressing conventional hub location issue. Each strategy assigns a value to every customer based distance and demand parameters, in which customers are prioritized this value. Then, vehicle fleet is scheduled according priority. A new mixed-integer linear programming model presented applied for each location-scheduling problem solved by three approaches. using CAB dataset, extensive experiments designed evaluate strategy. The strategies evaluated with statistical non-statistical analyses ranked accordingly. In case, comparison of non-priority best prioritization shows that has an adverse effect delivery time (i.e., 129.7%, 171.68%, 161.33% than case near, medium, far nodes, respectively). addition above tests, other tests conducted optimum number vehicles different conditions. results show as between hubs increases, reducing increasing their capacity preferable. Also, requires certain vehicles.